Symmetric Tridiagonal Inverse Quadratic Eigenvalue Problems with Partial Eigendata
نویسنده
چکیده
In this paper we concern the inverse problem of constructing the n-by-n real symmetric tridiagonal matrices C and K so that the monic quadratic pencil Q(λ) := λI + λC + K (where I is the identity matrix) possesses the given partial eigendata. We first provide the sufficient and necessary conditions for the existence of an exact solution to the inverse problem from the self-conjugate set of prescribed four eigenpairs. To find a physical solution for the inverse problem where the matrices C and K are weakly diagonally dominant and have positive diagonal elements and negative off-diagonal elements, we consider the inverse problem from the partial measured noisy eigendata. We propose a regularized smoothing Newton method for solving the inverse problem. The global and quadratic convergence of our approach is established under some mild assumptions. Some numerical examples and a practical engineering application in vibrations show the efficiency of our method.
منابع مشابه
On the alternating direction method of multipliers for nonnegative inverse eigenvalue problems with partial eigendata
We consider the nonnegative inverse eigenvalue problem with partial eigendata, which aims to find a nonnegative matrix such that it is nearest to a pre-estimated nonnegative matrix and satisfies the prescribed eigendata. In this paper, we propose several iterative schemes based on the alternating direction method of multipliers for solving the nonnegative inverse problem. We also extend our sch...
متن کاملNonnegative inverse eigenvalue problems with partial eigendata
In this paper we consider the inverse problem of constructing an n-by-n real nonnegative matrix A from the prescribed partial eigendata. We first give the solvability conditions for the inverse problem without the nonnegative constraint and then discuss the associated best approximation problem. To find a nonnegative solution, we reformulate the inverse problem as a monotone complementarity pro...
متن کاملSemidefinite inverse eigenvalue problems with prescribed entries and partial eigendata
In this paper, we study the semidefinite inverse eigenvalue problem of reconstructing a real n-by-n matrix C such that it is nearest to the original pre-estimated real n-by-n matrix Co in the Frobenius norm and satisfies the measured partial eigendata, where the required matrix C should preserve the symmetry, positive semidefiniteness, and the prescribed entries of the preestimated matrix Co. W...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملA smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata
In this paper we consider an inverse problem for a damped vibration system from the noisy measured eigendata, where the mass, damping, and stiffness matrices are all symmetric positive definite matrices with the mass matrix being diagonal and the damping and stiffness matrices tridiagonal. To take into consideration the noise in the data, the problem is formulated as a convex optimization probl...
متن کامل